搜索资源列表
DFS.rar
- 深度优先算法,用深度优先来遍历树结构,能够取得很好的复杂度,Depth-first algorithm, using depth-first traversal tree structure to achieve a good complexity
eyetracking.rar
- 实时跟踪人脸,对人脸进行处理,定位人眼,基于C++与MATLAB实现,Real-time tracking of human faces, human face processing, positioning the human eye, based on the C++ and MATLAB to achieve
PBFSandDFS
- 对与数据结构中有向图采用邻接矩阵为存储结构实现有向图建立、深度优先遍历和广度优先遍历、并带有图片测试数据 可运行-And the data structure of a directed graph with adjacency matrix storage structure established to achieve a directed graph, depth-first traversal and breadth-first traversal, and test data can
tubianli
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-To adjacent multi-table storage structure for connectivity undirected graph depth-first and breadth-first traversal. User-specified node as a starting point, respectively, under t
Java
- jbuilder2006下做的一个JAVA八数码问题的解法,注意采用了深度优先算法-jbuilder2006 done under a JAVA Problem eight digital, pay attention to depth-first algorithm using
Maze32
- 用C实现的迷宫求解算法。图形界面,求解过程参照了深度优先搜索,迷宫由随即矩阵生成,采用栈作为路径存储结构-Implemented in C maze solving algorithm. Graphical interface, the solution process with reference to the depth-first search, then the matrix generated by the maze, using the stack as the storage st
guohewenti
- 试运用深度优先搜索算法寻找过河问题的一个解决方案,题目叙述如下:猎人、狗、男人带着男孩1、男孩2,女人带着女孩1、女孩2,一共8个个体。一艘小船,一次只能过两个个体,狗和四个小孩不会划船。注意:(1)猎人不在,狗咬任何人;(2)男人不在,女人打男孩;(3)女人不在,男人打女孩。-Test the use of depth-first search algorithm to find a solution to cross the river problem, topics are describ
Sudoku
- 解数独的源码,使用深度优先搜索解决,有可视化的界面,能够很快的解出数独存在的一组解-Sudoku source, using the depth-first search
C4_5.m
- his algorithm was proposed by Quinlan (1993). The C4.5 algorithm generates a classification-decision tree for the given data-set by recursive partitioning of data. The decision is grown using Depth-first strategy. The algorithm considers all the poss
data_struct7
- 数据结构课后设计题第七章 7.22③ 试基于图的深度优先搜索策略写一算法, 判别以邻接表方式存储的有向图中是否存在由顶 点vi到顶点vj的路径(i≠j)。 注意:算法中涉及 的图的基本操作必须在此存储结构上实现。 实现下列函数: Status DfsReachable(ALGraph g, int i, int j) -Data structure design question after class Chapter 7.22 ③ test graph-b
bashuma
- 分别用深度优先和广度优先来算八数码问题,c++源码-Were depth-first and breadth of the priority issues to count eight digital, c++ source code
DFSforeightnumbers
- 人工智能完成的作业,利用深度优先遍历实现八数码问题,可以设置搜索的深度,计算生成的节点数目。-AI to complete the job, using depth-first traversal for Eight digital problem, you can set the search depth, calculate the number of nodes generated.
8Digit
- 使用了A*,A,深度优先,宽度优先等算法解决八数码,由于高强度的优化,使得运算十分之快,而且功能齐全,界面好看.是上学期俺做的人工智能作业.-The use of A*, A, depth-first, breadth-first algorithm to solve, such as eight digital, high-intensity as a result of the optimization, making a very fast operation, and full-feat
grapher
- 深度优先,广度优先,最短路径,最小生成树的图形演示以及源代码-Depth-first, breadth-first, shortest path, minimum spanning tree, as well as graphical presentation source
1
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题-This program is breadth-first search, depth-first search, A algorithm and A algorithm and many other algorithms to solve the problem of digital 8
T-tracking_Ver0.1
- 1、基于深度摄像机的手势跟踪、手势识别、轮廓识别、运动目标坐标输出代码 2、基于Primesense公司深度图 3、技术涉及复杂图形学算法,感兴趣的朋友,希望你们能发展中国自己的识别技术发展。 4、能够运行于Window,Linux,Android系统,全球第一个能够运用Android系统深度摄像的手势跟踪实现代码。 5、有部分OpenCV函数被简化。 6、代码的思路和细节已经有发明专利保护,拒绝完全抄袭,希望在此基础上大家创新-1, the depth of the cam
Maze
- 神奇的迷宫小游戏,包含有迷宫自动生成的算法,实现了“左手摸墙”算法,深度优先,广度优先搜索算法,以自动寻路。-Magic maze game maze includes automatic generation algorithm, to achieve a " left hand touching the wall" algorithm, depth first, breadth-first search algorithm to automatically find its
graph
- 实现图的深度优先遍历和图的广度优先遍历的控制台应用程序-Graph depth-first traversal and graph breadth-first traversal of the console application
dfstraverse
- 完成输入图,然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal
graphsearch
- 包含图的深度优先探索遍历和广度优先探索遍历,能从图中的任一顶点出发访问图中所有顶点-Includes plans to explore the depth-first traversal and breadth-first traversal to explore, from the graph the starting point of any visit to Figure 1 for all vertices